Constructions for Cubic Graphs with Large Girth
نویسندگان
چکیده
منابع مشابه
Constructions for Cubic Graphs with Large Girth
The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer μ0(g), the smallest number of vertices for which a cubic graph with girth at least g exists, and furthermore, the minimum value μ0(g) is attained by a graph whose girth is exactly g. The values of μ0(g) when 3 ≤ g ≤ 8 have been known for over thirty y...
متن کاملDomination in Cubic Graphs of Large Girth
We prove that connected cubic graphs of order n and girth g have domination number at most 0.32127n+O ( n g ) .
متن کاملFractional colorings of cubic graphs with large girth
We show that every (sub)cubic n-vertex graph with sufficiently large girth has fractional chromatic number at most 2.2978 which implies that it contains an independent set of size at least 0.4352n. Our bound on the independence number is valid to random cubic graphs as well as it improves existing lower bounds on the maximum cut in cubic graphs with large girth.
متن کاملDomination number of cubic graphs with large girth
We show that every n-vertex cubic graph with girth at least g have domination number at most 0.299871n + O (n/g) < 3n/10 + O (n/g).
متن کاملGeneration of cubic graphs and snarks with large girth
We describe two new algorithms for the generation of all non-isomorphic cubic graphs with girth at least k ≥ 5 which are very efficient for 5 ≤ k ≤ 7 and show how these algorithms can be efficiently restricted to generate snarks with girth at least k. Our implementation of these algorithms is more than 30, respectively 40 times faster than the previously fastest generator for cubic graphs with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 1998
ISSN: 1077-8926
DOI: 10.37236/1386